Approximation Algorithms for Sorting λ-Permutations by λ-Operations
نویسندگان
چکیده
منابع مشابه
Descents of λ-unimodal cyclic permutations
We prove an identity conjectured by Adin and Roichman involving the descent set of λ-unimodal cyclic permutations. These permutations appear in the character formulas for certain representations of the symmetric group and these formulas are usually proven algebraically. Here, we give a combinatorial proof for one such formula and discuss the consequences for the distribution of the descent set ...
متن کاملĜ Ĝ Λ 11 Λ 12 Λ 21 Λ 21 Λ 22 Λ 22 Λ Λ̃ 0 0 Λ̂
In this paper we present an algorithm for pricing barrier options in one-dimensional Markov models. The approach rests on the construction of an approximating continuous-time Markov chain that closely follows the dynamics of the given Markov model. We illustrate the method by implementing it for a range of models, including a local Lévy process and a local volatility jump-diffusion. We also pro...
متن کاملBisection Algorithms for Solving λ-Fuzzy Measures
The theory of fuzzy measures has a great potential for real world applications, but limited by the lack of suitable identifying methods. This research proposes a bisection algorithm based on Sugeno’s λ-fuzzy measures. The proposed method is simple enough to suit the practical applications for the required data is similar to the traditional weighted-sum method. The computing complexity of this m...
متن کاملApproximation properties of λ-Bernstein operators
In this paper, we introduce a new type λ-Bernstein operators with parameter [Formula: see text], we investigate a Korovkin type approximation theorem, establish a local approximation theorem, give a convergence theorem for the Lipschitz continuous functions, we also obtain a Voronovskaja-type asymptotic formula. Finally, we give some graphs and numerical examples to show the convergence of [For...
متن کاملNormalization by evaluation for λ
We show that the set-theoretic semantics of λ—simply typed lambda calculus with a boolean type but no type variables—is complete by inverting evaluation using decision trees. This leads to an implementation of normalization by evaluation which is witnessed by the source of part of this paper being a literate Haskell script. We show the correctness of our implementation using logical relations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2021
ISSN: 1999-4893
DOI: 10.3390/a14060175